Towards Modelling Actor-Based Concurrency in Term Rewriting
نویسندگان
چکیده
In this work, we introduce a scheme for modelling actor systems within sequential term rewriting. In our proposal, a TRS consists of the union of three components: the functional part (which is specific of a system), a set of rules for reducing concurrent actions, and a set of rules for defining a particular scheduling policy. A key ingredient of our approach is that concurrent systems are modelled by terms in which concurrent actions can never occur inside user-defined function calls. This assumption greatly simplifies the definition of the semantics for concurrent actions, since no term traversal will be needed. We prove that these systems are well defined in the sense that concurrent actions can always be reduced. Our approach can be used as a basis for modelling actor-based concurrent programs, which can then be analyzed using existing techniques for term rewrite systems. 1998 ACM Subject Classification D.1.3 Concurrent Programming
منابع مشابه
Processes for Adhesive Rewriting Systems
Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, including various modelling frameworks for concurrent and distributed systems. Here we begin the development of a truly concurrent semantics for adhesive rewriting systems by defining the fundamental notion of process, well-known fro...
متن کاملAbstract True Concurrency: Adhesive Processes
True Concurrency: Adhesive Processes Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Pawe l Sobociński 1 Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Italy 2 Dipartimento di Informatica, Università di Pisa, Italy 3 Institut für Formale Methoden der Informatik, Universität Stuttgart, Germany 4 Computer Laboratory, University of Cambridge, United Kingdom Abst...
متن کاملComputing with Terms and Graphs
Research in term and graph rewriting ranges from theoretical questions to practical issues. Computing with graphs handles the sharing of common subexpressions in a natural and seamless way, and improves the efficiency of computations in space and time. Sharing is ubiquitous in several research areas, as witnessed by the modelling of first-and higher-order term rewriting by (acyclic or cyclic) g...
متن کاملA Trully Concurrent Semantics for the K Framework Based on Graph Transformations
This paper gives a truly concurrent semantics with sharing of resources for the K semantic framework, an executable (term-)rewritingbased formalism for defining programming languages and calculi. Akin to graph rewriting rules, the K (rewrite) rules explicitly state what can be concurrently shared with other rules. The desired true concurrency is obtained by translating the K rules into a novel ...
متن کاملRelating Two Categorical Modelsof Term Rewriting ?
In the last years there has been a growing interest towards categorical models for term rewriting systems (trs's). In our opinion, very interesting are those associating to each trs's a cat-enriched structure: a category whose hom-sets are categories. Interpreting rewriting steps as morphisms in hom-categories, these models provide rewriting systems with a concurrent semantics in a clean algebr...
متن کامل